Simulate Human Saccadic Scan-Paths in Target Searching
نویسندگان
چکیده
منابع مشابه
Searching Paths of Constant Bandwidth
As a generalization of paths, the notion of paths of bandwidth w is introduced. We show that, for constant w ≥ 1, the corresponding search problem for such a path of length k in a given graph is NP-complete and fixed-parameter tractable (FPT) in the parameter k, like this is known for the special case w = 1, the LONGEST PATH problem. We state the FPT algorithm in terms of a guess and check prot...
متن کاملSearching for Differential Paths in MD4
The ground-breaking results of Wang et al. have attracted a lot of attention to the collision resistance of hash functions. In their articles, Wang et al. give input differences, differential paths and the corresponding conditions that allow to find collisions with a high probability. However, Wang et al. do not explain how these paths were found. The common assumption is that they were found b...
متن کاملOrthogonal Scan: Low-Overhead Scan for Data Paths
Orthogonal scan paths, which follow the path of the data flow, can be used in data path designs to reduce the test overhead — area, delay and test application time — by sharing functional and test logic. Orthogonal scan paths are orthogonal to traditional scan paths. Judicious ordering of the registers in the orthogonal scan path can allow the scan path to be implemented entirely with existing ...
متن کاملA VLSI Scan-Chain Optimization Algorithm for Multiple Scan-Paths
This paper presents an algorithm for the scanchain optimization problem in multiple-scan design methodology. The proposed algorithm, which consists of four phases, first determines pairs of scan-in and scan-out pins (Phase 1), and then assigns flip-flops to scan-paths by using a graph theoretical method (Phase 2). Next the algorithm decides connection-order of flipflops in each scan-path by usi...
متن کاملScan-chain Optimization Algorithms for Multiple Scan-paths
| This paper presents an algorithm framework for the scan-chain optimization problem in multiple-scan design methodology. It also presents algorithms we propose based on the framework; these are the rst algorithms ever proposed for multiplescan designing. Experiments using actual design data show that, for ten scan-paths, our algorithms achieved a 90% reduction in scan-test time at the expense ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Intelligence Science
سال: 2016
ISSN: 2163-0283,2163-0356
DOI: 10.4236/ijis.2016.61001